Detecting constraint redundancy in 0-1 linear programming problems
نویسندگان
چکیده
منابع مشابه
Grey prediction in linear programming problems
The purpose of this paper is describes the use of grey pridiction in linear programming problems. Some definitions and concepts of grey system theory are introduced and then, we introduced GM(1,1) and fractional order accumulation into grey model. Due to the fluctuation of prices and the lack of certainty data in the market, optimal production was calculated to optimize the profit from sales us...
متن کاملSENSITIVITY ANALYSIS IN LINEAR-PLUS-LINEAR FRACTIONAL PROGRAMMING PROBLEMS
In this paper, we study the classical sensitivity analysis when the right - hand – side vector, and the coefficients of the objective function are allowed to vary.
متن کاملA goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملDetecting and Resolving Inconsistency and Redundancy in Conditional Constraint Satisfaction Problems
Model debugging is an important component of assisting modelers with constraint-based problem formulation. This paper is built around a case study in modeling a special class of CSPs, which represent problems that change when certain conditions are met (Mittal & Falkenhainer 1990). The control of changing the problem, by activating or deactivating variables, is part of the problem representatio...
متن کاملConstraint Optimal Selection Techniques (COSTs) for nonnegative linear programming problems
where x is an n-dimensional column vector of variables; A is an m×n matrix [aij ] with m rows of transposed n-dimensional column vectors ai , ∀i = 1, . . . ,m; b is an m-dimensional column vector; c is an n-dimensional column vector; and 0 is a column vector of zeros of appropriate dimension according to context. Simplex pivoting algorithms and polynomial interior-point barrier-function methods...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista de Matemática: Teoría y Aplicaciones
سال: 2009
ISSN: 1409-2433
DOI: 10.15517/rmta.v8i1.193